package DynamicProgramming.Easy;

public class LC1137 {
    public int tribonacci(int n) {
        long[] dp = new long[Math.max(3, n + 1)];
        dp[0] = 0;
        dp[1] = 1;
        dp[2] = 1;
        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
        }
        return (int) dp[n];
    }
}
